1342. Number of Steps to Reduce a Number to Zero - LeetCode Solution


Bit Manupilation

Python Code:

class Solution:
    def numberOfSteps (self, num: int) -> int:
        count =0 
        while num!=0:
            if num%2==0:
                num = num/2
                count+=1
                
            else:
                num-=1
                count+=1

        
        return count
        


Comments

Submit
0 Comments
More Questions

1422A - Fence
21D - Traveling Graph
1559B - Mocha and Red and Blue
1579C - Ticks
268B - Buttons
898A - Rounding
1372B - Omkar and Last Class of Math
1025D - Recovering BST
439A - Devu the Singer and Churu the Joker
1323A - Even Subset Sum Problem
1095A - Repeating Cipher
630F - Selection of Personnel
630K - Indivisibility
20B - Equation
600B - Queries about less or equal elements
1015A - Points in Segments
1593B - Make it Divisible by 25
680C - Bear and Prime 100
1300A - Non-zero
1475E - Advertising Agency
1345B - Card Constructions
1077B - Disturbed People
653A - Bear and Three Balls
794A - Bank Robbery
157A - Game Outcome
3B - Lorry
1392A - Omkar and Password
489A - SwapSort
932A - Palindromic Supersequence
433A - Kitahara Haruki's Gift